منابع مشابه
A Parser for Portable NL Interfaces Using Graph-Unification-Based Grammars
This paper presents the reasoning behind the selection and design of a parser for the Lingo project on natural language interfaces at MCC. The major factors in the selection of the parsing algorithm were the choices of having a syntactically based grammar, using a graph-unification-based representation language, using Combinatory Categorial Grammars, and adopting a one-to-many mapping from synt...
متن کاملA Parsing Algorithm for Unification Grammar
We describe a table-driven parser for unification grammar that combines bottom-up construction of phrases with top-down filtering. This algorithm works on a class of grammars called depth-bounded grammars, and it is guaranteed to halt for any input string. Unlike many unification parsers, our algorithm works directly on a unification grammar--it does not require that we divide the grammar into ...
متن کاملParallel Parsing for Unification Grammars
The parsing problem for a rb i t r a ry un i f icat ion grammars is unsolvable We present a class of un i f i ca t ion grammars for whcih the parsing problem is solvable and a para l le l parsing algori thm for th is class of grammars 1. In t roduc t ion Uni f icat ion grammars have the power of a Turing machine, and one can easily prove this by showing that a un i f i ca t ion grammar can simu...
متن کاملUnification-based Multimodal Parsing
In order to realize their full potential, multimodal systems need to support not just input from multiple modes, but also synchronized integration of modes. Johnston et al (1997) model this integration using a unification operation over typed feature structures. This is an effective solution for a broad class of systems, but limits multimodal utterances to combinations of a single spoken phrase...
متن کاملEfficient Disjunctive Unification for Bottom-Up Parsing
This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first is a safe but fast method for discarding irrelevant disjunctions from newlycreated structures. The second reduces the time required to check the consistency of a structure from exponential to polynomial in the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2003
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(03)90034-4